Well Founded Semantics and Stable Semantics of Semi-Strict Programs
نویسنده
چکیده
In this paper we exhibit a condition on the syntax of the logic programs with negation, the semi-strictness property, which assures the equivalence of the well founded semantics and the stable semantics: so, for semi-strict programs the well founded model is total if and only if the program has an unique stable model.
منابع مشابه
Equivalence of Well-Founded and Stable Semantics
We show that the well-founded semantics and the stable semantics are equivalent on the class of the order-consistent programs which is a strict super-class of the locally-stratified programs class and of the call-consistent programs class. (1) Université de Paris 1 90 rue de Tolbiac 75634 Paris cedex 13 FRANCE email: [email protected]
متن کاملSemantics of Logic Programs withAggregatesDavid
We investigate the semantics of aggregates (count, sum, : : :) in logic programs with function symbols and negation. In particular we address the meaning of programs with recursion through aggregation. We extend the two most successful semantic approaches to the problem of recursion through negation, well founded models and stable models, to programs with aggregates. We examine previously deene...
متن کاملMinimal Well-founded Semantics and Autoepistemic Circumscription
In this paper we propose the minimal well-founded semantics for logic programs with negation based on the xpoint of the double Gelfond-Lifschitz transformation which overcomes the existing problems associated with the stable, the well-founded, and the stable class semantics. By representing logic programs as autoepistemic theories, we are able to represent various semantics as simple circumscri...
متن کاملWell-Founded semantics for Semi-Normal Extended Logic Programs
In this paper we present a new approach for applying well-founded semantics to extended logic programs. The main idea is not to fundamentally change the definition of well-founded semantics (as others have attempted) but rather to define a few restrictions on the content of the extended logic program, that make it possible to apply “traditional” well-founded semantics in a very straightforward ...
متن کاملNon-monotonic Negation in Hybrid Probabilistic Logic Programs
In [23], a new Hybrid Probabilistic Logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hybrid Probabilistic Logic Programs framework of [23] is extended to allow non-monotonic negation, and two alternative semantics are defined: stable probabilistic model semantics and ...
متن کامل